منابع مشابه
Two particles ’ repelling random walks on the complete graph
We consider two particles’ repelling random walks on complete graphs. In this model, each particle has higher probability to visit the vertices which have been seldom visited by the other one. By a dynamical approach we prove that the two particles’ occupation measure asymptotically has small joint support almost surely if the repulsion is strong enough.
متن کاملMatrix Decomposition on the Star Graph
—We present and evaluate, for the first time, a parallel algorithm for solving the LU decomposition problem on the star graph. The proposed parallel algorithm is of O(N 3 /n!) computation complexity and uses O(Nn) communication time to decompose a matrix of order N on a star graph of dimension n, where N ≥ (n-1)!. The incurred communication time is better than the best known results for the hyp...
متن کاملOn the genus of the star graph
The star graph S n is a graph with S n the set of all permutations over f1; : : :; ng as its vertex set; two vertices 1 and 2 are connected if 1 can be obtained form 2 by swapping the rst element of 1 with one of the other n ? 1 elements. In this paper we establish the genus of the star graph. We show that the genus, g n of S n , is exactly equal to n!(n?4)=6+1 by establishing a lower bound and...
متن کاملParallel Clustering on the Star Graph
In this paper, a parallel algorithm for data clustering is presented on a multi-computer with star topology. This algorithm is fast and requires a small amount of memory per processing element, which makes it even suitable for SIMD implementation. The proposed parallel algorithm completes in O(K+S T) steps for a clustering problem of N data patterns with M features per pattern and K clusters, w...
متن کاملBroadcasting on Incomplete Star Graph Interconnection Networks
In this paper, we propose two one-to-all optimal broadcasting algorithms in incomplete star graphs. A n incomplete star graph with N nodes, where (n l ) ! < N < n! , is a subgraph of an n-star. Using a routing scheme to transmit a message to each substar composed of the incomplete star, our proposed broadcasting algorithm is optimal in O(n1ogn) on the single-port communication model. While broa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Russian Journal of Mathematical Physics
سال: 2008
ISSN: 1061-9208,1555-6638
DOI: 10.1134/s1061920808040043